On Asymptotic Notation with Multiple Variables
نویسنده
چکیده
We show that it is impossible to define big-O notation for functions on more than one variable in a way that implies the properties commonly used in algorithm analysis. We also demonstrate that common definitions do not imply these properties even if the functions within the big-O notation are restricted to being strictly nondecreasing. We then propose an alternative definition that does imply these properties whenever the function within the big-O notation is strictly nondecreasing.
منابع مشابه
Asymptotic Notation. Part I: Theory
The widely used textbook by Brassard and Bratley [2] includes a chapter devoted to asymptotic notation (Chapter 3, pp. 79–97). We have attempted to test how suitable the current version of Mizar is for recording this type of material in its entirety. A more detailed report on this experiment will be available separately. This article presents the development of notions and a follow-up article [...
متن کاملBiałystok Asymptotic Notation . Part I : Theory 1
The widely used textbook by Brassard and Bratley [3] includes a chapter devoted to asymptotic notation (Chapter 3, pp. 79–97). We have attempted to test how suitable the current version of Mizar is for recording this type of material in its entirety. A more detailed report on this experiment will be available separately. This article presents the development of notions and a follow-up article [...
متن کاملAsymptotic properties of the sample mean in adaptive sequential sampling with multiple selection criteria
We extend the method of adaptive two-stage sequential sampling toinclude designs where there is more than one criteria is used indeciding on the allocation of additional sampling effort. Thesecriteria, or conditions, can be a measure of the targetpopulation, or a measure of some related population. We developMurthy estimator for the design that is unbiased estimators fort...
متن کاملAnother Asymptotic Notation : "Almost"
Asymptotic notations are heavily used while analysing runtimes of algorithms. Present paper argues that some of these usages are non trivial, therefore incurring errors in communication of ideas. After careful reconsideration of the various existing notations a new notation is proposed. This notation has similarities with the other heavily used notations like Big-Oh, Big Theta, while being more...
متن کاملA Fistful of Dollars: Formalizing Asymptotic Complexity Claims via Deductive Program Verification
We present a framework for simultaneously verifying the functional correctness and the worst-case asymptotic time complexity of higher-order imperative programs. We build on top of Separation Logic with Time Credits, embedded in an interactive proof assistant. We formalize the O notation, which is key to enabling modular specifications and proofs. We cover the subtleties of the multivariate cas...
متن کامل